Learning by On-Line State Space Refinement
نویسنده
چکیده
An approach for automatic control using on-line learning is presented. This approach uses a set of adaptive elements, each of which corresponds to a (hyperspherical) region of state space. The state space partition is initially coarse. An adaptive element is activated when the state enters its region, allowing the element to attempt to optimize the response within this region. The region size is periodically reduced to permit the element to obtain a more accurate suboptimal response. New adaptive elements are generated to maintain coverage of state space, with characteristics drawn from neighboring regions. During on-line operation the resulting state space partition undergoes successive refinement, with learning (and memory requirements) concentrated in the most frequently-arising areas, and with "generalization" occurring over successively smaller areas.
منابع مشابه
Successive Refinement of Empirical Models
An approach for automatic control using on-line learning is presented. The controller’s model for the system represents the effects of control actions in v,’u’ious (hyperspherical) regions of state space. The partition produced by these regions is initially coarse, limiting optimization of the corresponding control actions. Regions contract periodically to enable optimization to progress furthe...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملAgent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the relational domains with the states and actions in relational form. In the model, the logical negation is represented explicitly, so that the abstract state space can be constructed from the goal state(s) of a given ta...
متن کاملReinforcement Learning in Complex Environments Through Multiple Adaptive Partitions
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its application on a tabular model. In this paper, we introduce LEAP (Learning Entities Adaptive Partitioning), a model-free learning algorithm that uses overlapping partitions which are dynamically modified to learn near-opti...
متن کاملImproved State Aggregation with Growing Neural Gas in Multidimensional State Spaces
Q-Learning is a widely used method for dealing with reinforcement learning problems. However, the conditions for its convergence include an exact representation and sufficiently (in theory even infinitely) many visits of each state-action pair—requirements that raise problems for large or continuous state spaces. To speed up learning and to exploit gained experience more efficiently it is highl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002